Tractability of approximating multivariate linear functionals
نویسندگان
چکیده
منابع مشابه
Tractability of Approximating Multivariate Linear Functionals
We review selected tractability results for approximating linear tensor product functionals defined over reproducing kernel Hilbert spaces. This review is based on Volume II of our book [5] Tractability of Multivariate Problems. In particular, we show that all non-trivial linear tensor product functionals defined over a standard tensor product unweighted Sobolev space suffer the curse of dimens...
متن کاملGeneralized Tractability for Multivariate Problems Part II: Linear Tensor Product Problems, Linear Information, and Unrestricted Tractability
We continue the study of generalized tractability initiated in our previous paper “Generalized tractability for multivariate problems, Part I: Linear tensor product problems and linear information”, J. Complexity, 23, 262-295 (2007). We study linear tensor product problems for which we can compute linear information which is given by arbitrary continuous linear functionals. We want to approxima...
متن کاملInterpolating distributed approximating functionals
In this paper, we present a class of distributed approximating functionals ~DAF’s! for solving various problems in the sciences and engineering. Previous DAF’s were specifically constructed to avoid interpolation in order to achieve the ‘‘well-tempered’’ limit, in which the same order error is made both on and off the grid points. These DAF’s are constructed by combining the DAF concept with va...
متن کاملTractability of multivariate analytic problems
In the theory of tractability of multivariate problems one usually studies problems with finite smoothness. Then we want to know which s-variate problems can be approximated to within ε by using, say, polynomially many in s and ε−1 function values or arbitrary linear functionals. There is a recent stream of work for multivariate analytic problems for which we want to answer the usual tractabili...
متن کاملGeneralized tractability for multivariate problems Part I: Linear tensor product problems and linear information
Many papers study polynomial tractability for multivariate problems. Let n(ε, d) be the minimal number of information evaluations needed to reduce the initial error by a factor of ε for amultivariate problem defined on a space of d-variate functions. Here, the initial error is the minimal error that can be achieved without sampling the function. Polynomial tractability means that n(ε, d) is bou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Fixed Point Theory and Applications
سال: 2010
ISSN: 1661-7738,1661-7746
DOI: 10.1007/s11784-010-0018-8